منابع مشابه
Scheduling Jobs Using Common Resources
This paper examines the problem of distributed resource allocation in different models of computation and communication in distributed systems, and presents a number of time optimal (randomized and deterministic) allocation algorithms. We consider the dining drinking philosophers problem as presented in [B. Awerbuch and M. Saks, in ``FOCS,'' pp. 65 74. IEEE, New York, 1990]. In the algorithm pr...
متن کاملScheduling Resources for Executing a Partial Set of Jobs
In this paper, we consider the problem of choosing a minimum cost set of resources for executing a specified set of jobs. Each input job is an interval, determined by its start-time and end-time. Each resource is also an interval determined by its start-time and end-time; moreover, every resource has a capacity and a cost associated with it. We consider two versions of this problem. In the part...
متن کاملFast Multi-objective Scheduling of Jobs to Constrained Resources Using a Hybrid Evolutionary Algorithm
The problem tackled here combines three properties of scheduling tasks, each of which makes the basic task more challenging: job scheduling with precedence rules, co-allocation of restricted resources of different performances and costs, and a multi-objective fitness function. As the algorithm must come up with results within a few minutes runtime, EA techniques must be tuned to this limitation...
متن کاملScheduling Adaptively Parallel Jobs Scheduling Adaptively Parallel Jobs
An adaptively parallel job is one in which the number of processors which can be used without waste changes during execution. When allocating processors to multiple adap-tively parallel jobs, a job scheduler should attempt to be fair|meaning that no job gets fewer processors than another, unless it demands fewer|and eecient|meaning that the scheduler does not waste processors on jobs that do no...
متن کاملScheduling Jobs Before Shut -
Distributed systems execute background or alternative jobs while waiting for data or requests to arrive from another processor. In those cases, the following shut-down scheduling problem arises: given a set of jobs of known processing time, schedule them on m machines so as to maximize the total weight of jobs completed before an initially unknown deadline. We will present optimally competitive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1996
ISSN: 0890-5401
DOI: 10.1006/inco.1996.0020